A Basic Parallel Sparse Eigensolver for Structural Dynamics
نویسنده
چکیده
In this work the basic Finite Element Tearing and Interconnecting (FETI) linear system solver and the PARPACK eigensolver are combined to compute the smallest modes of symmetric generalized eigenvalue problems that arise from structures modeled ‘primarily’ by solid finite elements. Problems with over one million unknowns are solved. A comprehensive and relatively self-contained description of the FETI method is presented.
منابع مشابه
A Parallel Computational Kernel for Sparse Nonsymmetric Eigenvalue Problems on Multicomputers
The aim of this paper is to show an effective reorganization of the nonsymmetric block lanczos algorithm efficient, portable and scalable for multiple instructions multiple data (MIMD) distributed memory message passing architectures. Basic operations implemented here are matrix-matrix multiplications, eventually with a transposed and a sparse factor, LU factorisation and triangular systems sol...
متن کاملA Parallel Scalable PETSc-Based Jacobi-Davidson Polynomial Eigensolver with Application in Quantum Dot Simulation
The Jacobi-Davidson (JD) algorithm recently has gained popularity for finding a few selected interior eigenvalues of large sparse polynomial eigenvalue problems, which commonly appear in many computational science and engineering PDE based applications. As other inner–outer algorithms like Newton type method, the bottleneck of the JD algorithm is to solve approximately the inner correction equa...
متن کاملA parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc’s efficient and various parallel operations, linear so...
متن کاملA parallel eigensolver using contour integration for generalized eigenvalue problems in molecular simulation
In this paper, we consider a parallel method for computing interior eigenvalues and corresponding eigenvectors of generalized eigenvalue problems which arise from molecular orbital computation of biochemistry applications. Matrices in such applications are sparse but often have relatively large number of nonzero elements, and we may require some eigenpairs in a specific part of the spectrum. We...
متن کاملParallel Computing for Nonlinear Dynamic Finite Element Structural Analysis with General Sparse Matrix Technology
The principal objective of this research is to reduce the elapsed time of largescale nonlinear dynamic structural finite element analysis using parallel computing techniques. The major tasks and contributions of this research are: (a) employing the general sparse matrix technique to reduce the computing time and storage requirements for both sequential and parallel substructure analysis (b) emp...
متن کامل